Byzantine disk paxos: optimal resilience with byzantine shared memory
نویسندگان
چکیده
منابع مشابه
Fast Byzantine Paxos
The consensus problem can be described in terms of the actions taken by three classes of agents: proposers, who propose values, acceptors, who together are responsible for choosing a single proposed value, and learners, who must learn the chosen value [10]. A single processor can act as more than one kind of agent. Consensus can be specified using the following three safety properties and two l...
متن کاملEfficient Asynchronous Byzantine Agreement with Optimal Resilience
Byzantine agreement (BA) is considered as one of the most fundamental primitives for fault-tolerant distributed computing and cryptographic protocols. BA among a set of n parties each having an input value, allows them to reach agreement on a common value even if some of the parties are faulty and try to prevent agreement among the non-faulty parties. A preliminary version of this paper appeare...
متن کاملInformation-Theoretically Secure Byzantine Paxos
We present Information Theoretically secure Byzantine Paxos (IT ByzPaxos), the first deterministic asynchronous Byzantine consensus protocol that is provably secure despite a computationally unbounded adversary. Previous deterministic asynchronous algorithms for Byzantine consensus rely on unproven number theoretic assumptions (i.e., digital signatures) to maintain agreement. IT ByzPaxos instea...
متن کاملCommunication Optimal Multi-valued Asynchronous Byzantine Agreement with Optimal Resilience
Byzantine Agreement (BA) and Broadcast (BC) are considered to be the most fundamental primitives for fault-tolerant distributed computing and cryptographic protocols. An important variant of BA and BC is Asynchronous Byzantine Agreement (ABA) and Asynchronous Broadcast (called as A-cast) respectively. Most often in the literature, protocols for ABA and A-cast were designed for a single bit mess...
متن کاملAsynchronous Byzantine Agreement with Optimal Resilience and Linear Complexity
Given a system with n > 3t+1 processes, where t is the tolerated number of faulty ones, we present a fast asynchronous Byzantine agreement protocol that can reach agreement in O(t) expected running time. This improves the O(n2) expected running time of Abraham, Dolev, and Halpern [1]. Furthermore, if n = (3 + ε)t for any ε > 0, our protocol can reach agreement in O(1/ε) expected running time. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 2005
ISSN: 0178-2770,1432-0452
DOI: 10.1007/s00446-005-0151-6